Cyclic shifts - HackerEarth Solution

t = int(input())

for i in range(t):
    e = input().split(" ")
    currrent = int(e[0])
    currrent = bin(currrent)
    currrent = currrent[2:]
    count = 0

    last = currrent

    while(True):
        if(len(currrent)!= 16):
            currrent = "0" + currrent
        else:
            break

    if(e[2] == "L"):
        last = currrent[:int(e[1])]
        currrent = currrent + last
        currrent = currrent[int(e[1]):]
    else:
        last = currrent[16 - int(e[1]) : ]
        currrent = last + currrent
        currrent = currrent[:16]

    for j in range(len(currrent)):
        count += int(currrent[len(currrent) - 1 - j]) * (2**j)

    print(count)